C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

نویسندگان

چکیده

We consider a broad family of vehicle routing problem variants with many complex and practical constraints, known as rich problems, which are faced on daily basis by C.H. Robinson (CHR). Because CHR has customers, each distinct requirements, various problems different objectives constraints must be solved. propose novel framework for solving we demonstrate is effective in variety problems. This framework, along simple user interface, been wrapped into new module integrated the company’s transportation planning execution technology platform. Since its implementation, this outperformed previously used third-party technologies at CHR, significantly reduced setup times, improved users’ productivity well customer outcomes.

منابع مشابه

An Effective Search Framework Combining Meta-Heuristics to Solve the Vehicle Routing Problems with Time Windows

Many delivery problems in real-world applications such as the newspaper delivery and courier services can be formulated as capacitated vehicle routing problems (VRPs) [10], which we want to route a number of vehicles with limited capacity in order to satisfy customer requests with the minimal operational cost. This is usually measured by the number of vehicles used multiplied by the total dista...

متن کامل

Special issue on Rich Vehicle Routing Problems

Editorial The Vehicle Routing Problem (VRP) is a key to efficient transportation management and supply-chain coordination. In broad terms, it deals with the optimal assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle. The VRP has a large number of real-life applications and comes in many guises, depending on the type of operation, th...

متن کامل

Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

Insertion heuristics have proven to be popular methods for solving a variety of vehicle routing and scheduling problems. In this paper, we focus on the impact of incorporating complicating constraints on the efficiency of insertion heuristics. The basic insertion heuristic for the standard vehicle routing problem has a time complexity of O(n). However, straightforward implementations of handlin...

متن کامل

Integer Programming-Based Heuristics for Vehicle Routing Problems

Title of dissertation: INTEGER PROGRAMMING-BASED HEURISTICS FOR VEHICLE ROUTING PROBLEMS Damon J. Gulczynski Doctor of Philosophy, 2010 Dissertation directed by: Professor Bruce Golden Applied Mathematics and Scientific Computation Robert H. Smith School of Business The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical ap...

متن کامل

Heuristics for vehicle routing problems: Sequence or set optimization?

We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer “assignment” and visits “sequencing” decision variables. We show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences (using Concorde TSP solver) during each move evaluation is promising but requires a prohibitive computation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INFORMS journal on applied analytics

سال: 2022

ISSN: ['2644-0873', '2644-0865']

DOI: https://doi.org/10.1287/inte.2021.1090